Multiset random context grammars, checkers, and transducers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiset random context grammars, checkers, and transducers

1 Microsoft Research, University of Trento Centre for Computational and Systems Biology Trento, Italy [email protected] 2 Faculty of Informatics Vienna University of Technology Favoritenstr. 9–11, A–1040 Vienna, Austria {rudi,marion}@emcc.at 3 Department of Computer Science and Artificial Intelligence University of Sevilla, Av. Reina Mercedes, 41012, Sevilla, Spain 4 Departmen...

متن کامل

Random context tree grammars and tree transducers

Regular tree grammars and top-down tree transducers are extended by random context sensitivity as known from the areas of string and picture generation. First results regarding the generative power of the resulting devices are presented. In particular, we investigate the path languages of random context tree languages. Copyright c © 2005 UMINF 05.02 ISSN 0348-0542

متن کامل

On fuzzy multiset regular grammars

The main goal of this paper is to introduce and study fuzzy multiset regular grammar to show that fuzzy multiset finite automata and fuzzy multiset regular grammars are equivalent. We also study fuzzy multiset linear grammars and fuzzy multiset regular grammars in normal form. Furthermore, we show the equivalence of fuzzy multiset regular grammars, fuzzy multiset left linear grammars, fuzzy mul...

متن کامل

Graph Grammars and Tree Transducers

Regular tree grammars can be used to generate graphs, by generating expressions that denote graphs. Top-down and bottom-up tree transducers are a tool for proving properties of such graph generating tree grammars.

متن کامل

Constraint Relation Multiset Grammars for Visual Languages

This paper proposes grammars for visual languages. The proposed grammars introduce relations into the constraint multiset grammars[4J. Relations are the constraints on the relationships among symbols in visual languages. The proposed grammars. which are called constraint relation multiset grammars. have the relations as the first class citizens of the grammars because the relationships among sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2007

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2006.11.022